E (theorem prover) - définition. Qu'est-ce que E (theorem prover)
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est E (theorem prover) - définition

THEOREM PROVER
Stephan Schulz; E equational theorem prover; E theorem prover

E (theorem prover)         
E is a high-performance theorem prover for full first-order logic with equality. It is based on the equational superposition calculus and uses a purely equational paradigm.
Automated theorem proving         
SUBFIELD OF AUTOMATED REASONING DEALING WITH PROVING THEOREMS BY COMPUTER PROGRAMS
Automating theorem proving; Theorem proving; Automatic theorem proving; Automated theorem prover; First-order theorem provers; Automatic theorem prover; Automated deduction; Automated prover; Automatic proof system; Automated theorem provers; Theorem-proving system; Theorem-proving systems; Formalized theorem proving; Theorem-prover; List of automated theorem provers; Comparison of automated theorem provers; List of theorem provers; Computer generated proof; Proof automation; Applications of automated theorem proving; Automated proof; History of automated theorem proving; Benchmarks for automated theorem provers; Benchmarks for theorem provers; Automated mathematical proof; Automated mathematical induction
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs. Automated reasoning over mathematical proof was a major impetus for the development of computer science.
Divergence theorem         
  • n}}
  • A volume divided into two subvolumes. At right the two subvolumes are separated to show the flux out of the different surfaces.
  • The volume can be divided into any number of subvolumes and the flux out of ''V'' is equal to the sum of the flux out of each subvolume, because the flux through the <span style="color:green;">green</span> surfaces cancels out in the sum. In (b) the volumes are shown separated slightly, illustrating that each green partition is part of the boundary of two adjacent volumes
  • </math> approaches <math>\operatorname{div} \mathbf{F}</math>
  • The divergence theorem can be used to calculate a flux through a [[closed surface]] that fully encloses a volume, like any of the surfaces on the left. It can ''not'' directly be used to calculate the flux through surfaces with boundaries, like those on the right. (Surfaces are blue, boundaries are red.)
  • The vector field corresponding to the example shown. Vectors may point into or out of the sphere.
GENERALIZATION OF THE FUNDAMENTAL THEOREM IN VECTOR CALCULUS
Gauss' theorem; Gauss's theorem; Gauss theorem; Ostrogradsky-Gauss theorem; Ostrogradsky's theorem; Gauss's Theorem; Divergence Theorem; Gauss' divergence theorem; Ostrogradsky theorem; Gauss-Ostrogradsky theorem; Gauss Ostrogradsky theorem; Gauss–Ostrogradsky theorem
In vector calculus, the divergence theorem, also known as Gauss's theorem or Ostrogradsky's theorem, reprinted in is a theorem which relates the flux of a vector field through a closed surface to the divergence of the field in the volume enclosed.

Wikipédia

E (theorem prover)

E is a high-performance theorem prover for full first-order logic with equality. It is based on the equational superposition calculus and uses a purely equational paradigm. It has been integrated into other theorem provers and it has been among the best-placed systems in several theorem proving competitions. E is developed by Stephan Schulz, originally in the Automated Reasoning Group at TU Munich, now at Baden-Württemberg Cooperative State University Stuttgart.